Spectra of large diluted but bushy random graphs

نویسندگان

  • Nathanaël Enriquez
  • Laurent Ménard
چکیده

We compute an asymptotic expansion in 1/c of the limit in n of the empirical spectral measure of the adjacency matrix of an Erdős-Rényi random graph with n vertices and parameter c/n. We present two different methods, one of which is valid for the more general setting of locally tree-like graphs. The second order in the expansion gives some information about the edge of the spectrum. MSC 2010 Classification: 05C80; 60B20.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Stretched-exponential behavior and random walks on diluted hypercubic lattices.

Diffusion on a diluted hypercube has been proposed as a model for glassy relaxation and is an example of the more general class of stochastic processes on graphs. In this article we determine numerically through large-scale simulations the eigenvalue spectra for this stochastic process and calculate explicitly the time evolution for the autocorrelation function and for the return probability, a...

متن کامل

epl draft Spectra of Random Stochastic Matrices and Relaxation in Complex Systems

Abstract – We compute spectra of large stochastic matrices W , defined on sparse random graphs in the configuration model class, i.e. on graphs that are maximally random subject to a given degree distribution. Edges (i, j) of the graph are given positive random weights Wij > 0 in such a fashion that column sums are normalized to one. We compute spectra of such matrices both in the thermodynamic...

متن کامل

Spectra of random graphs with arbitrary expected degrees

We study random graphs with arbitrary distributions of expected degree and derive expressions for the spectra of their adjacency and modularity matrices. We give a complete prescription for calculating the spectra that is exact in the limit of large network size and large vertex degrees. We also study the effect on the spectra of hubs in the network, vertices of unusually high degree, and show ...

متن کامل

Dynamical replica analysis of processes on finitely connected random graphs: II. Dynamics in the Griffiths phase of the diluted Ising ferromagnet

Abstract We study the Glauber dynamics of Ising spin models with random bonds, on finitely connected random graphs. We generalize a recent dynamical replica theory with which to predict the evolution of the joint spin-field distribution, to include random graphs with arbitrary degree distributions. The theory is applied to Ising ferromagnets on randomly diluted Bethe lattices, where we study th...

متن کامل

THE SPECTRAL DETERMINATION OF THE MULTICONE GRAPHS Kw ▽ C WITH RESPECT TO THEIR SIGNLESS LAPLACIAN SPECTRA

The main aim of this study is to characterize new classes of multicone graphs which are determined by their signless Laplacian spectra. A multicone graph is defined to be the join of a clique and a regular graph. Let C and K w denote the Clebsch graph and a complete graph on w vertices, respectively. In this paper, we show that the multicone graphs K w ▽C are determined by their signless ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Random Struct. Algorithms

دوره 49  شماره 

صفحات  -

تاریخ انتشار 2016